package searchable;

import wrapper.Int;

public class MainSearchTree {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BinarySearchTree bst = new BinarySearchTree();
		bst.insert(new Int(5));
		bst.insert(new Int(1));
		bst.insert(new Int(3));
		bst.insert(new Int(2));
		bst.insert(new Int(6));
		bst.insert(new Int(7));
		bst.insert(new Int(4));
		//bst.printTree();
		bst.printVisitorTree(new PrintTreeVisitor());
		bst.withdraw(new Int(4));
		bst.withdraw(new Int(1));
		System.out.println("\n");
		//bst.printTree();
		System.out.println("************");
		bst.printVisitorTree(new PrintTreeVisitor());
	}

}
